FLASc: a formal algebra for labeled property graph schema

نویسندگان

چکیده

Abstract Contemporary labeled property graph databases are either schema-less or schema-optional to support frequent changes in the structure of data found domains requiring high flexibility. However, lack impacts transformation and loading operations from heterogeneous sources into databases. We present a formal algebra for specifying generating schema formally define demonstrate use generated schemas systematically transform load data-sets related cyber-physical systems, big analytics tourism. Findings three disparate case studies show that -generated assist enforcing integrity constraints reduce chance corruption, hence assuring consistency integrity.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Formal Algebra for OLAP

Online Analytical Processing (OLAP) comprises tools and algorithms that allow querying multidimensional databases. It is based on the multidimensional model, where data can be seen as a cube, where each cell contains one or more measures can be aggregated along dimensions. Despite the extensive corpus of work in the field, a standard language for OLAP is still needed, since there is no well-def...

متن کامل

A General Formal Framework for Schema Transformation

From: Data & Knowledge Engineering Volume 28, Pages 47--71, Elsevier, 1998 Several methodologies for integrating database schemas have been proposed in the literature, using various common data models (CDMs). As part of these methodologies transformations have been defined that map between schemas which are in some sense equivalent. This paper describes a general framework for formally underpin...

متن کامل

A Labeled Graph Kernel for Relationship Extraction

In this paper, we propose an approach for Relationship Extraction (RE) based on labeled graph kernels. The kernel we propose is a particularization of a random walk kernel that exploits two properties previously studied in the RE literature: (i) the words between the candidate entities or connecting them in a syntactic representation are particularly likely to carry information regarding the re...

متن کامل

A Formal Algebra for OLAP Link

Online Analytical Processing (OLAP) comprises tools and algorithms that allow querying multidimensional databases. It is based on the multidimensional model, where data can be seen as a cube, where each cell contains one or more measures can be aggregated along dimensions. Despite the extensive corpus of work in the field, a standard language for OLAP is still needed, since there is no well-def...

متن کامل

Formal Theories for Linear Algebra

We introduce two-sorted theories in the style of [CN10] for the complexity classes ⊕L and DET , whose complete problems include determinants over Z2 and Z, respectively. We then describe interpretations of Soltys’ linear algebra theory LAp over arbitrary integral domains, into each of our new theories. The result shows equivalences of standard theorems of linear algebra over Z2 and Z can be pro...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Automated software engineering

سال: 2022

ISSN: ['0928-8910', '1573-7535']

DOI: https://doi.org/10.1007/s10515-022-00336-y